- multiprocessor machine
- Компьютерная техника: многопроцессорная машина
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
Multiprocessor scheduling — In computer science, multiprocessor scheduling is an NP complete optimization problem. The problem statement is: Given a set J of jobs where job ji has length li and a number of processors mi, what is the minimum possible time required to… … Wikipedia
Virtual machine — A virtual machine (VM) is a completely isolated guest operating system installation within a normal host operating system .[1] Modern virtual machines are implemented with either software emulation or hardware virtualization or (in the most… … Wikipedia
Alewife (multiprocessor) — APRIL redirects here. See April (disambiguation) for other uses. Alewife was a cache coherent multiprocessor developed in the early 1990s at the Massachusetts Institute of Technology. [citation|title=The MIT Alewife Machine: A Large Scale… … Wikipedia
Data diffusion machine — is a historical virtual shared memory architecture where data is free to migrate through the machine. Shared memory machines are convenient for programming but do not scale beyond tens of processors. The Data Diffusion Machine (DDM) overcomes… … Wikipedia
Parallel Random Access Machine — In computer science, Parallel Random Access Machine (PRAM) is a shared memory abstract machine. As its name indicates, the PRAM was intended as the parallel computing analogy to the random access machine (RAM). In the same way, that the RAM is… … Wikipedia
Graph reduction machine — A graph reduction machine is a special purpose computer built to perform combinator calculations by graph reduction.Examples include the SKIM ( S K I machine ) computer, built at the University of Cambridge Computer Laboratory, and the… … Wikipedia
Symmetric multiprocessing — In computing, symmetric multiprocessing (SMP) involves a multiprocessor computer hardware architecture where two or more identical processors are connected to a single shared main memory and are controlled by a single OS instance. Most common… … Wikipedia
Cilk — Paradigm(s) imperative (procedural), structured, parallel Appeared in 1994 Designed by MIT Laboratory for Computer Science Developer Intel … Wikipedia
Sequent (MUD) — Sequent was a DikuMUD based MUD running on a Sequent multiprocessor machine at sequent.berkeley.edu as early as May 1991. [cite web url=http://groups.google.com/group/rec.games.mud/msg/c02bff436e06cc2c title=MUD List author=Joseph Wisdom… … Wikipedia
Marked graph — A marked graph is a Petri net in which every place has exactly one incoming arc, and exactly one outgoing arc. This means, that there can not be conflict, but there can be concurrency. Mathematically: . Marked graphs are used mostly to… … Wikipedia
Global Interpreter Lock — (abbr. GIL) is a mutual exclusion lock held by a programming language interpreter thread to avoid sharing code that is not thread safe with other threads. There is always one GIL for one interpreter process.Usage of a Global Interpreter Lock in a … Wikipedia